{\rtf1\ansi\ansicpg1252\uc1\deff0
{\fonttbl{\f0\fmodern\fcharset0\fprq2 RobotoMono-SemiBold;}}
{\colortbl;\red0\green0\blue0;\red255\green255\blue255;\red128\green128\blue128;}
\paperw12240\paperh15840\margl1800\margr1800\margt1440\margb1440\f0\fs22\cf0
\pard\plain \tx0\tx360\tx720\tx1080\tx1440\tx1800\tx2160\tx2880\tx3600\tx4320\ltrch\loch {\f0\fs22\b0\i0 Isn't this just "Automata-Based Programming"?}
\par\plain {\f0\fs22\b0\i0 \tab Yes, basically, though "Automata-Based Programming" seems to be even deader a term than "Synchronous Programming".}
\par\plain \f0\fs22\b0\i0
\par\plain {\f0\fs22\b0\i0 There\loch\af0\hich\af0\dbch\af0\uc1\u8217\'92s a lot of research into finite-state automata, particularly in converting regular expressions to FSMs.}}